Large contractible subgraphs of a 3-connected graph
نویسندگان
چکیده
منابع مشابه
Contractible Subgraphs in 3-Connected Graphs
For a graph G we define a graph T (G) whose vertices are the triangles in G and two vertices of T (G) are adjacent if their corresponding triangles in G share an edge. Kawarabayashi showed that if G is a k-connected graph and T (G) contains no edge then G admits a kcontractible clique of size at most 3, generalizing an earlier result of Thomassen. In this paper, we further generalize Kawarabaya...
متن کاملOn Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree
We study the distribution of small contractible subgraphs in 3-connected graphs under local regularity conditions. AMS classification: 05c40, 05c75, 05c35.
متن کاملPartitioning a Graph into Highly Connected Subgraphs
Given k ≥ 1, a k-proper partition of a graph G is a partition P of V (G) such that each part P of P induces a k-connected subgraph of G. We prove that if G is a graph of order n such that δ(G) ≥ √ n, then G has a 2-proper partition with at most n/δ(G) parts. The bounds on the number of parts and the minimum degree are both best possible. We then prove that If G is a graph of order n with minimu...
متن کاملCircumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph is Ω(n), and the circumference of a 3-connected claw-free graph is Ω(n). We generalise and improve the first result by showing that every 3-edge-connected graph with m edges has an Eulerian subgraph with Ω(m) edges. We ...
متن کاملEvery DFS Tree of a 3-Connected Graph Contains a Contractible Edge
Let G be a 3-connected graph on more than 4 vertices. We show that every depth-first-search tree of G contains a contractible edge. Moreover, we show that if G is 3-regular or does not have two disjoint pairs of adjacent degree-3 vertices, every spanning tree of G contains a contractible edge.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2021
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2172